import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int[] nums = new int[n];
        int i = 0;
        for (int j = 0; j < n; j++) {
            nums[j] = in.nextInt();
        }
        int min = 0;
        int left = n - 1;
        Arrays.sort(nums);//排序
        while (k > 0 && left >= 0) {
            if (nums[left] % 4 == 0) {
                nums[left] /= 4;
                k -= 2;
            } else if (nums[left] % 2 == 0) {
                nums[left] /= 2;
                k--;
            }
            left--;
        }
        for (int j = 0; j < n; j++) {
            min += nums[j];
        }
        System.out.println(min);
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        int n = in.nextInt();
        int x = in.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = in.nextInt();
        }

        int l = 0;
        int r = 0;
        while (r < n) {

        }
    }
}